About the spectral analysis of large random Markov kernels

نویسنده

  • Djalil Chafaï
چکیده

This tiny note concerns the spectral analysis of models of random Markov kernels, centered around joint works in collaboration with Charles Bordenave and Pietro Caputo, with a “large random matrices” point of view. Some open problems are given. A (rather old now) survey about the spectral analysis of large random Markov kernels can be found in [9]. An up to date review can be found in the Habilitation thesis of Charles Bordenave under preparation (gives a complete bibliography). These models can be seen as random walks or Markov chains in random environment. From the random matrix theory point of view, these random matrices have dependent entries, and what is know concerns mostly first order asymptotics for empirical spectral distributions, spectral edge, and principal eigenvector. In particular, the study of the asymptotic fluctuations is completely open.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Searching Remote Homology with Spectral Clustering with Symmetry in Neighborhood Cluster Kernels

UNLABELLED Remote homology detection among proteins utilizing only the unlabelled sequences is a central problem in comparative genomics. The existing cluster kernel methods based on neighborhoods and profiles and the Markov clustering algorithms are currently the most popular methods for protein family recognition. The deviation from random walks with inflation or dependency on hard threshold ...

متن کامل

An efficient method for cloud detection based on the feature-level fusion of Landsat-8 OLI spectral bands in deep convolutional neural network

Cloud segmentation is a critical pre-processing step for any multi-spectral satellite image application. In particular, disaster-related applications e.g., flood monitoring or rapid damage mapping, which are highly time and data-critical, require methods that produce accurate cloud masks in a short time while being able to adapt to large variations in the target domain (induced by atmospheric c...

متن کامل

ar X iv : m at h - ph / 0 40 90 75 v 1 2 9 Se p 20 04 MARKOV PROCESSES ON PARTITIONS

We introduce and study a family of Markov processes on partitions. The processes preserve the so-called z-measures on partitions previously studied in connection with harmonic analysis on the infinite symmetric group. We show that the dynamical correlation functions of these processes have determinantal structure and we explicitly compute their correlation kernels. We also compute the scaling l...

متن کامل

Graph-based LearningModels for Information Retrieval: A Survey

3 Graph Analysis 6 3.1 Analysis Based on Spectral Graph Theory . . . . . . . . . . . . . 7 3.2 Analysis Based on Random Field Theory . . . . . . . . . . . . . . 9 3.2.1 Markov Random Fields . . . . . . . . . . . . . . . . . . . . 9 3.2.2 Conditional Random Fields . . . . . . . . . . . . . . . . . 10 3.2.3 Gaussian Random Fields . . . . . . . . . . . . . . . . . . . 11 3.3 Analysis Based onMatri...

متن کامل

ar X iv : m at h / 03 07 33 0 v 2 [ m at h . PR ] 2 9 M ay 2 00 4 SPECTRAL MEASURE OF LARGE RANDOM HANKEL , MARKOV AND TOEPLITZ MATRICES

We study the limiting spectral measure of large symmetric random matrices of linear algebraic structure. For Hankel and Toeplitz matrices generated by i.i.d. random variables {Xk} of unit variance, and for symmetric Markov matrices generated by i.i.d. random variables {Xi,j}j>i of zero mean and unit variance, scaling the eigenvalues by √ n we prove the almost sure, weak convergence of the spect...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012